Distributed subgradient method for multi‐agent optimization with quantized communication

This paper focuses on a distributed optimization problem associated with a time‐varying multi‐agent network with quantized communication, where each agent has local access to its convex objective function, and cooperatively minimizes a sum of convex objective functions of the agents over the network. Based on subgradient methods, we propose a distributed algorithm to solve this problem under the additional constraint that agents can only communicate quantized information through the network. We consider two kinds of quantizers and analyze the quantization effects on the convergence of the algorithm. Furthermore, we provide explicit error bounds on the convergence rates that highlight the dependence on the quantization levels. Finally, some simulation results on a l₁‐regression problem are presented to demonstrate the performance of the algorithm. Copyright © 2016 John Wiley & Sons, Ltd.     

Geometric Design of Anode-Supported Micro-Tubular Solid Oxide Fuel Cells by Multiphysics Simulations

High volumetric power density (VPD) is the basis for the commercial success of micro-tubular solid oxide fuel cells (mtSOFCs). To find maximal VPD (MVPD) for anode-supported mtSOFC (as-mtSOFC), the effects of geometric parameters on VPD are analyzed and the anode thickness, t_an, and the cathode length, l_ca, are identified as the key design parameters. Thermo-fluid electrochemical models were built to examine the dependence of the electrical output on the cell parameters. The multiphysics model is validated by reproducing the experimental I-V curves with no adjustable parameters. The optimal l_ca and the corresponding MVPDs are then determined by the multiphysics model for 20 combinations of r_in, the inner tube radius, and t_an. And all these optimization are made at 1073.15 K. The results show that:(i) significant performance improvement may be achieved by geometry optimization, (ii) the seemingly high MVPD of 11 and 14 W/cm³ can be easily realized for as-mtSOFC with single-and double-terminal anode current collection, respectively. Moreover, the variation of the area specific power density with l_ca2(2 mm, 40 mm) is determined for three representative (r_in, t_an) combinations. Besides, it is demonstrated that the current output of mtSOFC with proper geometric parameters is comparable to that of planar SOFC.     

A stochastic portfolio optimization model with complete memory

In this article, we consider a portfolio optimization problem of the Merton’s type with complete memory over a finite time horizon. The problem is formulated as a stochastic control problem on a finite time horizon and the state evolves according to a process governed by a stochastic process with memory. The goal is to choose investment and consumption controls such that the total expected discounted utility is maximized. Under certain conditions, we derive the explicit solutions for the associated Hamilton–Jacobi–Bellman (HJB) equations in a finite-dimensional space for exponential, logarithmic, and power utility functions. For those utility functions, verification results are established to ensure that the solutions are equal to the value functions, and the optimal controls are also derived.     

A self‐adaptive intelligence gray prediction model with the optimal fractional order accumulating operator and its application

The self‐adaptive intelligence gray predictive model (SAIGM) has an alterable‐flexible model structure, and it can build a dynamic structure to fit different external environments by adjusting the parameter values of SAIGM. However, the order number of the raw SAIGM model is not optimal, which is an integer. For this, a new SAIGM model with the fractional order accumulating operator (SAIGM_FO) was proposed in this paper. Specifically, the final restored expression of SAIGM_FO was deduced in detail, and the parameter estimation method of SAIGM_FO was studied. After that, the Particle Swarm Optimization algorithm was used to optimize the order number of SAIGM_FO, and some steps were provided. Finally, the SAIGM_FO model was applied to simulate China's electricity consumption from 2001 to 2008 and forecast it during 2009 to 2015, and the mean relative simulation and prediction percentage errors of the new model were only 0.860% and 2.661%, in comparison with the ones obtained from the raw SAIGM model, the GM(1, 1) model with the optimal fractional order accumulating operator and the GM(1, 1) model, which were (1.201%, 5.321%), (1.356%, 3.324%), and (2.013%, 23.944%), respectively. The findings showed both the simulation and the prediction performance of the proposed SAIGM_FO model were the best among the 4 models.     

An adaptive nonmonotone global Barzilai–Borwein gradient method for unconstrained optimization

The Barzilai–Borwein (BB) gradient method has received many studies due to its simplicity and numerical efficiency. By incorporating a nonmonotone line search, Raydan (SIAM J Optim. 1997;7:26–33) has successfully extended the BB gradient method for solving general unconstrained optimization problems so that it is competitive with conjugate gradient methods. However, the numerical results reported by Raydan are poor for very ill-conditioned problems because the effect of the degree of nonmonotonicity may be noticeable. In this paper, we focus more on the nonmonotone line search technique used in the global Barzilai–Borwein (GBB) gradient method. We improve the performance of the GBB gradient method by proposing an adaptive nonmonotone line search based on the morphology of the objective function. We also prove the global convergence and the R-linear convergence rate of the proposed method under reasonable assumptions. Finally, we give some numerical experiments made on a set of unconstrained optimization test problems of the CUTEr collection. The results show the efficiency of the proposed method in the sense of the performance profile introduced (Math Program. 2002;91:201–213) by Dolan and Moré.     

A new robust DEA model and super-efficiency measure

Applications of traditional data envelopments analysis (DEA) models require knowledge of crisp input and output data. However, the real-world problems often deal with imprecise or ambiguous data. In this paper, the problem of considering uncertainty in the equality constraints is analyzed and by using the equivalent form of CCR model, a suitable robust DEA model is derived in order to analyze the efficiency of decision-making units (DMUs) under the assumption of uncertainty in both input and output spaces. The new model based on the robust optimization approach is suggested. Using the proposed model, it is possible to evaluate the efficiency of the DMUs in the presence of uncertainty in a fewer steps compared to other models. In addition, using the new proposed robust DEA model and envelopment form of CCR model, two linear robust super-efficiency models for complete ranking of DMUs are proposed. Two different case studies of different contexts are taken as numerical examples in order to compare the proposed model with other approaches. The examples also illustrate various possible applications of new models.     

椭圆PDE-约束优化问题的一个预条件子

针对由Galerkin有限元离散椭圆PDE-约束优化问题产生的具有特殊结构的3×3块线性鞍点系统,提出了一个预条件子并给出了预处理矩阵特征值及特征向量的具体表达形式.数值结果表明了该预条件子能够有效地加速Krylov子空间方法的收敛速率,同时也验证了理论结果.     

广义线性多乘积问题的完全多项式时间近似算法

本文针对广义线性多乘积极小化问题,通过一系列的线性规划问题的解提出一种求其全局最优解的完全多项式时间近似算法,并给出该算法的计算复杂性,且数值算例验证该算法是可行的.     

Generalized asymptotic functions in nonconvex multiobjective optimization problems

In this paper, we use generalized asymptotic functions and second-order asymptotic cones to develop a general existence result for the nonemptiness of the proper efficient solution set and a sufficient condition for the domination property in nonconvex multiobjective optimization problems. A new necessary condition for a point to be efficient or weakly efficient solution is given without any convexity assumption. We also provide a finer outer estimate for the asymptotic cone of the weakly efficient solution set in the quasiconvex case. Finally, we apply our results to the linear fractional multiobjective optimization problem.